SYNAPSE- A System for Logic Program Synthesis from Incomplete Specifications

نویسندگان

  • Pierre Flener
  • Yves Deville
چکیده

A logic program development methodology has been proposed by the second author [3]. It aims at programming-in-the-small, and is (mainly) meant for “algorithmic” problems. It starts from a complete, yet informal, specification of the target problem. A crucial step is the design of the logic of the program, based solely on the declarative semantics of logic, and with exclusive concern about correctness issues. Procedural semantics and efficiency are taken care of in a later optimization and implementation step. The methodology gives rise to many computer-assistance, if not automation, opportunities. The FOLON environment [9] aims at this, and is described elsewhere in this volume. But, as specifications are non-formal, the crucial step cannot be automated. This research thus investigates an alternative approach to logic program development, namely (fully) automated logic program synthesis. This requires formal specifications, and our choice went towards exploring synthesis from incomplete specifications. The resulting system, called SYNAPSE, is being integrated into the FOLON environment. Let R be the relation one has in mind when elaborating a specification of a procedure for predicate r. We call R the intended relation, in contrast to the relation actually specified, called the specified relation. This distinction is important in general, but crucial with incomplete specifications, where one deliberately admits a gap between the two. We assume R is known, even if we don’t have a formal definition of it. In our approach [5], incomplete specifications are expressed with examples and properties. More precisely, a specification by examples and properties of a relation r consists of: • a set of examples of r (ground atoms); and • a set of properties of r (non-recursive Horn clauses). The specified relation, that is the set of logical consequences of the given examples and properties, is assumed to be a subset of the intended relation R. Examples have been around for quite a while as an incomplete specification formalism. Their attractiveness lies in their naturalness and conciseness, but their weaknesses are ambi-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logic Program Synthesis from Incomplete Specifications

Program synthesis research aims at maximally automating the passage from specifications to programs (see the survey by Biermann, 1992). We define possible formalisms for the starting points (specifications: see Section 1.1) and results (programs: see Section 1.2) of synthesis, and state existing approaches and related work, before pinning down the objectives (Section 1.3) of this paper. Some fa...

متن کامل

Synthesis from Knowledge-Based Specifications

In program synthesis, we transform a specification into a program that is guaranteed to satisfy the specification. In synthesis of reactive systems, the environment in which the program operates may behave nondeterministically, e.g., by generating different sequences of inputs in different runs of the system. To satisfy the specification, the program needs to act so that the specification holds...

متن کامل

Inductive Synthesis of Recursive Logic Programs: Achievements and Prospects

The inductive synthesis of recursive logic programs from incomplete information, such as input/output examples, is a challenging subfield both of ILP (Inductive Logic Programming) and of the synthesis (in general) of logic programs from formal specifications. We first overview past and present achievements, focusing on the techniques that were designed specifically for the inductive synthesis o...

متن کامل

Several Strategies of Reactive System Program Synthesis

Reactive systems, such as operating systems or elevator control systems, are systems that ideally never terminate and are intended to maintain some interaction with their environment. Temporal logic is one of the methods for formal specification descriptions of reactive systems. By describing the formal specifications of reactive systems we can check the consistency of the specifications and wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992